Connected (s,t)-Vertex Separator Parameterized by Chordality
نویسندگان
چکیده
منابع مشابه
Connected (s, t)-Vertex Separator Parameterized by Chordality
We investigate the complexity of finding a minimum connected (s, t)vertex separator ((s, t)-CVS) and present an interesting chordality dichotomy: we show that (s, t)-CVS is NP-complete on graphs of chordality at least 5 and present a polynomial-time algorithm for (s, t)-CVS on chordality 4 graphs. Further, we show that (s, t)-CVS is unlikely to have δlog2− n-approximation algorithm, for any > 0...
متن کاملDeterministic Parameterized Connected Vertex Cover
In the Connected Vertex Cover problem we are given an undirected graph G together with an integer k and we are to find a subset of vertices X of size at most k, such that X contains at least one end-point of each edge and moreover X induces a connected subgraph. For this problem we present a deterministic algorithm running in O(2n) time and polynomial space, improving over previously best O(2.4...
متن کاملOn the Complexity of Connected (s, t)-Vertex Separator
We show that minimum connected (s, t)-vertex separator ((s, t)-CVS) is Ω(log2− n)-hard for any > 0 unless NP has quasi-polynomial Las-Vegas algorithms. i.e., for any > 0 and for some δ > 0, (s, t)-CVS is unlikely to have δ.log2− n-approximation algorithm. We show that (s, t)-CVS is NPcomplete on graphs with chordality at least 5 and present a polynomial-time algorithm for (s, t)-CVS on bipartit...
متن کاملA vertex incremental approach for maintaining chordality
For a chordal graph G = (V, E), we study the problem of whether a new vertex u 6∈ V and a given set of edges between u and vertices in V can be added to G so that the resulting graph remains chordal. We show how to resolve this efficiently, and at the same time, if the answer is no, specify a maximal subset of the proposed edges that can be added along with u, or conversely, a minimal set of ex...
متن کاملGraph Layout Problems Parameterized by Vertex Cover
In the framework of parameterized complexity, one of the most commonly used structural parameters is the treewidth of the input graph. The reason for this is that most natural graph problems turn out to be fixed parameter tractable when parameterized by treewidth. However, Graph Layout problems are a notable exception. In particular, no fixed parameter tractable algorithms are known for the Cut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2015
ISSN: 1526-1719
DOI: 10.7155/jgaa.00377